Tomographic imaging using poissonian detector data

ABSTRACT

An image reconstruction method for reconstructing a tomographic image (f j ) of a region of investigation within an object ( 1 ), comprises the steps of providing detector data (y i ) comprising Poisson random values measured at an i-th of a plurality of different positions, e.g. i=(k,l) with pixel index k on a detector device and angular index l referring to both the angular position (α l ) and the rotation radius (r l ) of the detector device ( 10 ) relative to the object ( 1 ), providing a predetermined system matrix A ij  assigning a j-th voxel of the object ( 1 ) to the i-th detector data (y i ), and reconstructing the tomographic image (f j ) based on the detector data (y i ), said reconstructing step including a procedure of minimizing a functional F(f) depending on the detector data (y i ) and the system matrix A ij  and additionally including a sparse or compressive representation of the object ( 1 ) in an orthobasis T, wherein the tomographic image (f j ) represents the global minimum of the functional F(f). Furthermore, an imaging method and an imaging device using the image reconstruction method are described.

ACKNOWLEDGEMENT OF GOVERNMENT SUPPORT

The work leading to this invention has received funding from the European Atomic Energy Community's Seventh Framework Programme ([FP7/2007-2011]) under grant agreement no FP7-212100.

FIELD OF THE INVENTION

The invention relates to an image reconstruction method for reconstructing a tomographic image of an object based on detector data contaminated with Poisson noise, especially detector data collected with an emission tomographic device, like e.g. a SPECT or PET imaging device, or with a transmission tomographic device, like a CT imaging device operating e.g. under low photon-flux conditions. In particular, the image reconstruction method is based on a non-analytical image reconstruction using a minimizing algorithm. Furthermore, the invention relates to an imaging method including the image reconstruction method. Furthermore, the invention relates to an imaging device implementing the imaging and image reconstruction methods.

BACKGROUND OF THE INVENTION

Non-analytical image reconstruction is a generally known approach for a volumetric reconstruction, most commonly used for emission tomographic data, based e.g. on SPECT (single photon emission computed tomography) or PET (positron emission tomography) measurements (see K. Lange et al. “EM Reconstruction Algorithms for Emission and Transmission Tomography” in “Journal of Computer Assisted Tomography”, vol. 8 (2), April 1984, p. 306-316, L. A. Shepp et al. “Maximum Likelihood Reconstruction for Emission Tomography” in “IEEE Transactions on Medical Imaging” vol. MI-1 (2), October 1982, p. 113-122), and J. Kay “The EM algorithm in medical imaging” in “Statistical Methods in Medical Research” vol. 6, 1997, p. 55-75). In contrast to the analytical approach, in particular using a back-projection algorithm (e.g. filtered back-projection, FBP), the non-analytical solution uses a minimizing algorithm for finding image data which represent the best fit for the detector data. The non-analytical approach intrinsically can cope better with input data suffering from noise and is able to account for physical processes degrading the measured data. The measured data often suffer from very bad photon statistics. In order to obtain useful results, long measurement times and relatively high patient doses are necessary, putting unnecessary stress on the patient. These restrictions would be avoided if images could be reconstructed from few measurements with the concept of Compressive Sensing (CS) as proposed e.g. for conventional optical images collected with a camera.

Compressed Sensing (or: compressive sensing, compressive sampling and sparse sampling), is a technique for acquiring and reconstructing a signal utilizing the prior knowledge that it is sparse or compressible. An introduction to CS has been presented by Emmanuel J. Candès et al. (“An Introduction To Compressive Sampling” in “IEEE Signal Processing Magazine” March 2008, p. 21-30). The CS theory shows that sparse signals, which contain much less information than could maximally be encoded with the same number of detected data entries, can be reconstructed exactly from very few measurements in noise free conditions.

According to Jarvis Haupt et al. (“Signal reconstruction from noisy random projections” in “IEEE Trans. on Information Theory” vol. 52(9), 2006, p. 4036-4048), a set of data f_(j)* of size v (j=1, . . . , v) which is sparse (or rather “compressible”) can be accurately reconstructed from a small number k of random projections even if the projections are contaminated by noise of constant variance, e.g. Gaussian noise. Specifically, y_(i)=Σ_(j)φ_(ij)f_(j)*+ξ_(l) with i=1, . . . , k are the noisy projections of f_(j)*, taken with the projection matrix φ_(ij) which consists of random entries all drawn from the same probability distribution with zero mean and variance 1/v and the noise ξ_(l) is drawn from a Gaussian probability distribution with zero mean and variance σ². By finding the minimizer {circumflex over (f)}_(j) of a certain functional (to be shown in detail below), one obtains an approximation to f_(j)* for which the average error is bounded by a constant times (k/log v)^(−a) with 0<a≦1, i.e. the error made depends only logarithmically on v. To put it another way, the error can be made small by choosing k/log v large, but it is by no means necessary to have k/v close to 1. Accurate reconstruction is possible even if the number of projections is much smaller than v, as long as k/log v is large.

A crucial point in the derivation of the above result is the fact that the variance of the noise ξ_(i) is a constant. Even though a similar results could be obtained for non-Gaussian noises (provided certain noise properties required for the validity of the Craig-Bernstein inequality can be proved), the result does not easily carry over to the case that the variance of the noise depends on the values f_(j)*. Yet this is precisely what happens e.g. in photon limited imaging systems or in emission tomography where a main source of noise is the discrete quantum nature of the photons. In this case the projections y_(i) have Poisson statistics with parameter μ_(i)=Σ_(j)φ_(ij)f_(j)*. This parameter is equal to the mean of y_(i) but also to its variance.

In the past, it was tested whether the principle of accurate reconstructions from few projections carries over to Poisson noise in order to make accurate reconstructions possible with fewer measurements, e.g. in emission tomography. It was expected that the compressive sensing strategy for the reconstruction of sparse or compressible objects from few measurements is difficult to apply to data corrupted with Poisson noise, due to the specific properties of Poisson statistics and the fact that measurements can not usually be made randomly, as in many other cases.

Rebecca M. Willett et al. (“Performance bounds on compressed sensing with Poisson noise” in “IEEE International Symposium on Information Theory ISIT” 2009, Jun. 28, 2009-Jul. 3, 2009, p. 174-178) have generalized results from Jarvis Haupt et al. to Poisson noise. In particular, Rebecca M. Willett et al. have proposed to reconstruct a tomographic image from detector data using a procedure of minimizing a functional {circumflex over (f)} depending on a sensing matrix A and the detector data and further depending on a penalty term, wherein the sensing matrix A is constructed on the basis of statistic Rademacher variables and the penalty term depends on the sparsity of the object. However, the result was discouraging: it was found that the upper bound on the error increases with the number of measurements, i.e. more measurements seem to make the accuracy smaller.

There is a strong interest in imaging techniques where the main source of noise is the Poisson statistics of the photons, e.g. in emission tomography, to apply CS strategies, in particular for obtaining shorter acquisition times and reduced motion artifacts.

OBJECTIVE OF THE INVENTION

The objective of the invention is to provide an improved image reconstruction method for reconstructing a tomographic image of an object, in particular for emission tomography purposes or for very low dose transmission tomography purposes, which is capable of avoiding disadvantages of conventional techniques. In particular, the objective is to provide an image reconstruction method which enables reconstructing the tomographic image with a reduced quantity of detector data without a loss in image quality. Furthermore, the objective of the invention is to provide an improved imaging method avoiding disadvantages of conventional imaging techniques. Furthermore, the objective of the invention is to provide an improved imaging device in particular being adapted for conducting the inventive imaging method.

SUMMARY OF THE INVENTION

The above objectives are solved by an image reconstruction method, an imaging method and/or an imaging device comprising the features of the independent claims Advantageous embodiments of the invention are defined in the dependent claims.

According to a first aspect of the invention, an image reconstruction method is proposed for reconstructing a tomographic image (f_(j)) of a region of investigation within an object from detector data (y_(i)) comprising Poisson random values measured at an i-th of a plurality of different positions relative to the object. The positions are the spatial locations of measuring the detector data, e.g. the position of a detector element (pixel) with index k of a SPECT detector device at the time of collecting data with this detector device under its l-th angular position α_(l) with respect to the object and under its l-th distance r_(l) from the centre of rotation (this means that in this case the index i is a two component index, i.e. i=(k,l)), or as a further example, spatial locations of detector elements sensing data at the lines of response (LOR's) of coincidence events measured with a PET detector device.

According to the invention, a predetermined system matrix A_(ij) assigning a j-th voxel of the object to the i-th detector data (y_(i)) is provided. Contrary to the above conventional approach of Rebecca M. Willett et al. using a random sensing matrix, elements of the system matrix A_(ij) are not statistic values but rather selected by geometrically or physically assigning contributions of each of the voxels (object data) to each detector element of a detector device or the associated detector data, resp. The system matrix which defines the detector data as linear combinations of the original object data is determined by geometric or physical features of the imaging device, in particular by the arrangement of the object relative to the detector device and the detector device geometry.

Furthermore, according to the invention, the tomographic image (f_(j)) is reconstructed by minimizing a functional F(f) depending on the detector data (y_(i)) and the system matrix A_(ij) and additionally including a sparse or compressive representation of the object in an orthogonal basis T. The orthogonal basis (orthobasis) T is an orthogonal matrix, the columns of which are orthonormal basis vectors. The orthobasis is selected such that the object, in particular the region of investigation, can be represented in the orthobasis fulfilling the requirements of sparsity or compressibility.

The minimizing procedure is a non-analytical or algebraic procedure, e.g. an iterative algorithm. The tomographic image (f_(j)) comprises the image data representing the global minimum of the functional F(f). In particular, the inventive reconstruction comprises minimizing the above functional F, which includes two or optionally three additive parts, namely an empiric risk part, which represents the Poisson statistic of the measurement, a CS part representing the compressibility of the object and (optionally) a regularization term.

For conventional reconstructions there are (at least) three problems. First, the data is noisy, second, it is necessary to perform a large number of measurements in order to obtain sufficient information for an acceptable reconstruction quality and third, the reconstruction problem is ill-posed such that without further measures even an infinitesimal amount of noise generates serious artifacts. The invention is capable of overcoming all three difficulties by providing a link between a compressive sensing strategy (solving problem two) and a maximum likelihood approach (which deals optimally with problem one) for the case of Poisson noise, while still allowing for inclusion of regularization techniques addressing problem three.

The image reconstruction method can be conducted immediately after collecting the detector data, in particular with the imaging device collecting the detector data. Alternatively, the image reconstruction method can be conducted with an image reconstruction device at a distant location and/or with a delay after the measurement with detector data provided e.g. via a data communication channel from the imaging device to the image reconstruction device or from a data storage. Accordingly, the detector data (y_(i)) can be provided e.g. via a data network, from a data storage or directly by the detector device.

According to a second aspect of the invention, an imaging method for reconstructing an image (f_(j)) of a region of investigation within an object is proposed, which comprises the steps of collecting the detector data (y_(i)) with the detector device of an imaging device and subjecting the detector data (y_(i)) to the inventive image reconstruction method according to the above first aspect of the invention. Preferably, the imaging method is used for collecting is a SPECT image, a PET image, a CT image or a confocal microscopy image.

According to a third aspect of the invention, an imaging device for imaging a region of investigation in an object is proposed, which comprises a detector device for measuring detector data (y_(i)) comprising Poisson random values measured at the i-th angular position of a detector element of the detector device relative to the object, and a reconstruction device for reconstructing an image (f_(j)) the object, wherein the detector data (y_(i)) are subjected to the image reconstruction method according to the above first aspect of the invention.

Further independent subjects of the invention are a computer program residing on a computer-readable medium, with a program code for carrying out the image reconstruction method according to the above first aspect of the invention, and an apparatus comprising a computer-readable storage medium containing program instructions for carrying out the image reconstruction method according to the above first aspect of the invention.

As a main advantage, the invention provides a new method to accurately reconstruct a three dimensional image from very few detector data, e.g. projections, by non-analytical or algebraic methods using a minimizing algorithm. The inventors have found methods of exploiting the fact that real world objects are usually sparse or at least compressible while overcoming the restrictions of conventional approaches for applying CS on Poisson noise data. Emission tomographic images can be reconstructed with a number of measurements which is reduced compared with conventional measurements, whereas the same accuracy as with conventional methods can be obtained. Accordingly measurement time and/or applied activity (for emission tomography) or irradiation dose (for transmission tomography) can thus be reduced.

Further advantages can be summarized as follows. First, the quantity of measurements for obtaining a certain image quality can be reduced compared with the conventional imaging technique yielding the same image quality. The measuring time and the burden for the patient can be reduced accordingly. In particular, artifacts resulting from unintended movements of the object, e.g. of the patient, can be avoided. Second, the image reconstruction method does not include a free parameter. In particular, if sufficient information is available as to the compressibility of the object data, the tomographic image can be obtained exclusively on the basis of the detector data and the system matrix determined by the measuring arrangement. Third, the reconstruction risk (see below) can be controlled. The quality of a reconstruction can be quantitatively evaluated. The image reconstruction method considers the Poisson statistic not only in the evaluation of the risk, but rather also with the reconstruction as such, i.e. the advantages of the maximum-likelihood reconstruction are associated with the advantage of a reduced number of measurements due to applying the CS technique. Finally, the inventive method can be extended in analogy to the penalized-likelihood method for a regularization of the reconstructed object.

According to a preferred embodiment of the inventive image reconstruction method, the reconstructing step includes a procedure of minimizing the functional F(f)=L({y _(i) },A f)+a∥T ^(T) f∥ wherein L({y_(i)}, A f) is the maximum-likelihood risk functional for Poisson statistics, ∥T^(T) f∥ is a sparsity enforcing functional including the l_(p) norm ∥ . . . ∥ of vector T^(T) f with 0≦p<2, and a is a calibration factor.

The orthogonal basis (orthobasis) T is selected to be as incoherent as possible with respect to the system matrix A_(ij) and such that the object f (or a comparable typical object) has a compressible representation in this basis. These criteria were introduced previously e.g. by J. Candès et al. (see above). A particular advantage of this embodiment, which is explained with further details below, can be obtained by the application of the l_(p) norm with 0≦p<2, e.g. p=1. In this case, the minimization procedure has a single global minimum allowing an implementation with an increased processing speed.

The calibration factor a is a predetermined fixed parameter, which is not changed during the minimization procedure, i.e. it is not a fit parameter. Further features of the calibration factor a are described below. By a preliminary determination of the calibration factor a, the tomographic reconstruction can be improved. This is a further difference compared with the above conventional approach of Rebecca M. Willett et al.

According to a further advantageous embodiment of the invention, the functional F(f) additionally can include an additive regularization function R(f) F(f)=L({y _(i) },A f)+a∥T ^(T) f∥+R(f). As an advantage, the regularization function R can be constructed for suppressing artifacts in the reconstructed tomographic image.

A further advantage of the invention is given by the fact that various approaches for determining (adjusting) the system matrix are available. As a first variant, the system matrix can be adjusted using reference data of the measuring system used for collecting the detector data. The reference data can be stored as specific data of the measuring system in the image reconstruction device, e.g. in the imaging device. According to a second variant, the entries of the system matrix can be acquired using a calibration measurement. In this case, collecting the detector data is performed with a calibration object (phantom) having known volumetric object data. The calibration detector data can be used for adjusting the elements of the system matrix.

Another advantage of the invention is given by the fact that various bases are available as orthobasis T. As it is known from the theory of three-dimensional wavelets (see A. Cohen et al. in “American Journal of Mathematics”, Volume 121, 1999, p. 587-628, and P. Bechler et al. in “Transactions of American Mathematical Society”, Volume 359 (2), 2007, p. 619-635), objects with so-called bounded variation have compressible wavelet coefficients. This condition is indeed fulfilled for the objects of the real world, so that a suitable orthobasis using three-dimensional wavelets with a finite support can be found for any object to be investigated. Therefore, according to a preferred embodiment of the invention, the orthobasis T is a basis of three-dimensional wavelets with a compact carrier. Alternatively, if a certain prior knowledge is available about the object or the structure thereof, an adapted orthobasis can be constructed with entries depending on typical object data of the object to be imaged. In this case, the orthobasis can be matched to the type of object for improving the image reconstruction. As an example, if it is known that the object is sufficiently smooth, it will have predominantly low spatial frequency components such that a Fourier basis is adequate. Alternatively, one could choose a basis of Chebyshev polynomials in the plane combined with a one dimensional Fourier basis in the axial direction. For real world objects a principal components analysis of a number of reference objects may generate a suitable orthobasis.

The invention provides further particular advantages for the imaging method, in particular for selecting or setting the angular positions at which the detector data are collected. According to a preferred embodiment of the invention, a randomized setting of the angular positions can be provided. According to a further, alternative embodiment of the invention, the detector data can be continuously collected, e.g. with a SPECT device while the angular positions of the detector device thereof are changed continuously and not in the usual step-and-shoot mode. Accordingly, the imaging speed can be essentially increased.

According to a further, particularly preferred embodiment of the invention, a preparation step can be provided before the collection of the detector data. The preparation step comprises a setting of an image quality measure (risk) to be fulfilled by the imaging method. Depending on the risk, the number of angular positions is selected at which detector data are collected. Accordingly, for obtaining a preview image wherein a low image quality is sufficient, a reduced number of angular positions is used, while for a subsequent regular imaging with improved image quality, the number of angular positions (and correspondingly detector data) is increased.

Further important features of the invention may be represented by additional steps conducted after the image reconstruction, like e.g. storing, recording, displaying and/or further image processing of the reconstructed tomographic image.

BRIEF DESCRIPTION OF THE DRAWINGS

Further details and advantages of the invention are described in the following with reference to the attached drawings, which show in:

FIG. 1: a schematic representation of an imaging device embodying the present invention;

FIG. 2: a schematic flowchart illustrating embodiments of the inventive image reconstruction and imaging methods; and

FIG. 3: experimental results illustrating the improved image quality obtained with the present invention.

DESCRIPTION OF PREFERRED EMBODIMENTS

Preferred embodiments of the invention are described here with exemplary reference to emission tomography, in particular SPECT. The application of the invention is not restricted to SPECT, but rather possible with other image data contaminated with a Poisson noise, like e.g. PET data and CT data, in particular with low photon flux. Details of measuring techniques, like e.g. details of SPECT devices and modes of operating those devices are not described as far as they are known from conventional techniques. Furthermore, the invention is not restricted to medical imaging, but rather can also be implemented for imaging other objects, like e.g. work pieces.

Embodiments of the invention are described in the following with reference to the procedural steps of the inventive methods. Implementing these features as data processing tools will depend on e.g. the measuring system used and the type of object to be imaged in practice. While the understanding and the implementation of the features is based on the mathematical background outlined below, the skilled person will recognize that the invention is not restricted to all mathematical details, but covers all data processing tools generally based on this mathematical background.

1. Imaging Device

FIG. 1 schematically illustrates a sectional view of an embodiment of an imaging device 100 including a detector device 10, an object carrier 20, a detector carrier 30 and a reconstruction device 40. The components 10, 20 and 30 are structured like in a conventional SPECT device, e.g. a one-headed Siemens e.cam. In particular, the detector device 10 comprises an array 11 of detector elements 11.i (i=1, 2, 3, . . . ), which are arranged in a one- or, more commonly, two-dimensional geometry (line-shaped array or matrix-shaped array). The detector device 10 is rotatably mounted on the detector carrier 30 such that it can be rotated in an x-y-plane around the object carrier 20. The object carrier 20 is a support device, e.g. table, configured for accommodating the object 1, e.g. a patient to be investigated. As an example, the object carrier 20 comprises a carrying bed for accommodating the patient as schematically illustrated in FIG. 1. The detector carrier 30 comprises e.g. a circular rail to which the detector device 10 is attached. The object carrier 20 and the detector carrier 30 can be translated relative to each other in a direction perpendicular to the x-y-plane (drawing plane).

The object 1 is e.g. a human patient, wherein a certain portion (region of investigation 2), e.g. the brain is to be investigated with the inventive imaging method. In terms of the imaging and image reconstruction methods, the region of investigation 2 is considered as consisting of a plurality of voxels 3. The j-th voxel 3 is schematically shown for illustrative purposes. The patient has an administered tracer substance which is accumulated with a concentration distribution in specific regions, e.g. certain tissue or organ. This concentration distribution is to be imaged. The tracer substance carries a radioactive marker emitting γ radiation as it is known from conventional SPECT measurements. The detector device 10 is moved to preferably randomized angular positions α_(l) and suitable detector radii r_(i) where the γ photons are detected. The collected detector data y_(i) together with α_(l) and r_(l) are transferred to the input circuit 41.

The reconstruction device 40 comprises an input circuit 41, a processing circuit 42, an output circuit 43, and an entry storage 44. The input circuit 41 is arranged for receiving the detector data and further entries, which are necessary for implementing the inventive image reconstruction method. To this end, the detector device 10 is connected with the input circuit 41 for transferring detector data y_(i) and the associated angular position α_(l). Furthermore, the input circuit 41 is connected with the entry storage 44 being arranged for storing the system matrix A_(ij), the orthobasis T and optionally the regularization function R. The processing circuit 42 includes a computer unit, which is configured for implementing the data processing of the image reconstruction method. Finally, the output circuit 43 may comprise a display 43.1, a data storage 43.2 and/or an interface 43.3. In particular, the output circuit 43 may include a Dicom-node. The reconstruction device 40 can be implemented with a standard computer having an appropriate hardware configuration.

2. Image Reconstruction and Imaging Methods

The essential steps of the inventive image reconstruction method are schematically summarized in FIG. 2. Firstly, the detector data with the associated angular positions as well as the remaining input entries are provided with step S1. Subsequently, the reconstructing step S2 with finding an object minimizing functional is conducted, followed by step S3 of presenting the tomographic image consisting of the minimizer of the functional.

Step S1 in particular includes the provision (step S11) of the detector data (as measured preferably) from random angular positions and the associated angles and radii. Step S11 depends on particular application conditions and the data source used. The detector data and angular positions can be measured (step S01) and input directly from the detector device 10 (FIG. 1). In this case, the procedure of FIG. 2 including the step S01 represents an embodiment of the inventive imaging method. Measuring the detector data is conducted as commonly known from SPECT devices. Optionally, selecting a number of measurements in dependence on the image quality to be obtained can be provided on the basis of the considerations summarized in 3.7 below. Furthermore, as an alternative, the detector data and angular positions can be input via a data communication channel (step S02). With this variant, steps S1 to S3 represent an embodiment of the inventive image reconstruction method.

Step S1 further includes step S12 of determining a sparsity orthobasis T which is suitable for the measured object, e.g. a wavelet basis with finite support. Depending on the type of object, the orthobasis can be stored in the entry storage 44 (FIG. 1). Furthermore, step S1 includes the provision of a predetermined system matrix A_(ij) (step S13). The system matrix is computed or acquired from reference system data. In particular, the system matrix represents the contribution of the j-th voxel 3 to the i-th detector data 11.i (FIG. 1).

With step S2, the data processing is conducted including the minimization routine, in which the three-dimensional object f_(j) is sought, which realizes the global minimum of the functional F(f)=L({y_(i)}, A f)+a∥T^(T) f∥. Details of this functional are outlined in section 3. below.

Finally, the result of the minimization routine is output as the final result with step S3, where it is transferred e.g. to a Dicom-node included in the output circuit 43 (FIG. 1).

3. Mathematical Background

In the following, it is demonstrated that the disappointing and seemingly counterintuitive result presented by Rebecca M. Willett et al. is essentially due to a too restrictive notion of “error”: since the variance of a Poissonian random variable increases when its mean value increases, it cannot be expected to obtain the same absolute accuracy when f_(j)* is large as when f_(j)* is small. Yet the measure of error used in by Rebecca M. Willett et al. was the risk

${R\left( {f^{*},f} \right)} = {\frac{1}{v}{\sum_{v}\left( {f_{j} - f_{j}^{*}} \right)^{2}}}$ (up to normalization), which does not take this into account. Note that this observation has nothing to do with the type of reconstruction algorithm and lies in the nature of the Poisson statistics.

When the definition of “risk” is modified to reflect this fact, it will be shown that the principles of compressive sensing can indeed be useful and allow the reconstruction of f_(j)* faithfully within the bounds given by nature.

3.1 Preliminary Discussion and Notations

A three dimensional object f_(j)* is considered, wherein the subscript j indexes the voxels, of which it is assumed to have v. The object is observed through projections

$\begin{matrix} {{{\overset{\_}{\mu}}_{i}^{*} = {{\sum\limits_{j}\;{A_{ij}f_{j}^{*}}} + r_{i}}},} & (1) \end{matrix}$ where A_(ij) is the system matrix, for example the discretized integral kernel of the Radon transform. The constants r_(i)>0 indicate the background count rate which is always present in practice. These projections are, however, not directly observed, but they are the parameter of a Poisson process, i.e. a number y_(i) of quanta (γ photons, for instance) is measured drawn from a Poisson distribution with probability

${P\left( y_{i} \right)} = {{\mathbb{e}}^{{- {\overset{\_}{\mu}}_{i}^{*}}\frac{{({\overset{\_}{\mu}}_{i}^{*})}^{y_{i}}}{y_{i}!}}.}$ From these measurements y_(i) the original object f_(j)* is to be reconstructed as accurately as possible from as few projections as possible. This is the situation usually seen in SPECT.

In order to formulate this problem mathematically, a large number n of “potential” projections μ _(i), i=1, . . . , n is considered. The number of projections n is assumed to be of the same order of the number of voxels, v, i.e. n=O(v). Only a small random subset iεΩ⊂{1, . . . , n} of the potential projections is actually measured. The set S2 has size k, and it will be shown in the end that k may be much smaller than n while still allowing for accurate reconstruction. Thus the actual projections are written as

$\begin{matrix} {{\mu_{i}^{*} = {\sum\limits_{j}{P_{ij}{\overset{\_}{\mu}}_{j}^{*}}}},{i = 1},\ldots\mspace{14mu},k} & (2) \end{matrix}$ where P_(ij) is a k×n random matrix of all 0s, except for exactly one 1 at a uniformly distributed random position in each row, with different rows being independent. For each of these random projections a noisy Poisson variable y_(i), i=1, . . . , k is measured. Note that this definition allows, in principle, that multiple measurements of the same projections are made. The probability of this happening is however small when n>>k. This definition of random projections is different from “Rademacher chaos” which is often used in the literature for which each entry is ±1 with equal probability (up to a constant factor). The reason is that for Poisson measurements there is a positivity requirement, and linear combinations with negative weights cannot be chosen (in fact the weights cannot be chosen at all as they are given by the system matrix), and thus it only can be randomized which projections are being used.

In order to measure the accuracy of the eventual reconstruction, the following definition of “risk” is used. A potential reconstruction f would produce projections μ _(i)=Σ_(j)A_(ij)f_(j) and has risk R(f) with

$\begin{matrix} {{R\left( \underset{\_}{f} \right)} = {\frac{1}{n}{\sum\limits_{i = 1}^{n}{\left( {{\overset{\_}{\mu}}_{i} - {{\overset{\_}{\mu}}_{i}^{*}{\log\left( {\overset{\_}{\mu}}_{i} \right)}}} \right)\mspace{14mu}\text{=:}\mspace{14mu}\frac{1}{n}{\sum\limits_{i = 1}^{n}{{R_{i}\left( {\overset{\_}{\mu}}_{i} \right)}.}}}}}} & (3) \end{matrix}$ The definition R_(i)( μ _(i))= μ _(i)− μ _(i)*log( μ _(i)) will be used below. This definition of risk is modeled after the Maximum Likelihood functional derived from Poisson statistics and honors the fact that the uncertainty in estimating a Poisson parameter μ is of order √{square root over (μ)} and not a constant. The risk is minimal when μ = μ *, which is the case when f=f*. The risk R(f) has the additional property that the “excess risk” r(f,f*):=R(f)−R(f*)  (4) is a homogeneous function of degree 1, i.e. r(λf,λf*)=λr(f,f*).  (5)

This shows that it is a measure of the absolute error, and that the relative error can be obtained by dividing r(f,f*) by a measure of the total intensity, e.g. by

$\kappa = {\frac{1}{n}{\sum\limits_{i = 1}^{n}{{\overset{\_}{\mu}}_{i}^{*}.}}}$

This definition of risk is not immediately useful since it requires complete knowledge of f*, which is to be estimated in the first place. Therefore the risk is to be estimated from the data actually measured, and this leads to the empirical risk {circumflex over (R)}(f):

$\begin{matrix} {{\hat{R}\left( \underset{\_}{f} \right)} = {\frac{1}{k}{\sum\limits_{i = 1}^{k}\left( {\mu_{i} - {y_{i}{\log\left( \mu_{i} \right)}}} \right)}}} & (6) \end{matrix}$ with μ_(i)=Σ_(j)P_(ij) μ _(j). Again, this is nothing but the Maximum Likelihood functional of Poisson statistics. It is easy to show that on average, E{circumflex over (R)}(f)=R(f). The average E . . . is an average over both the Poisson statistics of the y_(i) (to be done first) and the random matrices P_(ij). Analogously to above, the empirical excess risk is defined {circumflex over (r)}(f,f*)={circumflex over (R)}(f)−{circumflex over (R)}(f*).  (7)

Below the compressibility property of the object f* in some sparsity basis will be used. Let T^(T) be an orthogonal matrix the rows of which are filled with the orthonormal basis vectors of the sparsity basis. Then objects f* are considered for which the coefficients in the sparsity basis, θ*=T^(T) f*, obey |θ_(k) *|≦C′√{square root over (v)}k ^(−1/q),  (8) where C′>0 and 0<q are constants and the θ_(k)* are ordered by size. From this inequality one can easily conclude that the error of the best m-term approximation θ ^((m)) to θ* is bounded by

$\begin{matrix} \begin{matrix} {{\frac{1}{v}{{{\underset{\_}{\theta}}^{(m)} - {\underset{\_}{\theta}}^{*}}}^{2}} = {{\frac{1}{v}{\sum\limits_{k = {m + 1}}^{v}{\theta_{k}^{*}}^{2}}} \leq {C^{\prime\; 2}{\int_{m}^{v}{{\mathbb{d}x}\; x^{{- 2}/q}}}} \leq {\frac{C^{\prime\; 2}}{\frac{2}{q} - 1}m^{1 - {2/q}}}}} \\ {= {\frac{C^{\prime\; 2}}{2\;\alpha}m^{{- 2}\;\alpha}}} \end{matrix} & (9) \end{matrix}$ with

$\alpha = {\frac{1}{q} - {\frac{1}{2}.}}$ Likewise it can be shown that this implies

$\begin{matrix} {{\frac{1}{v}{{\underset{\_}{\theta}}^{*}}^{2}} = {{\frac{1}{v}{{\underset{\_}{f}}^{*}}^{2}} \leq {\frac{2}{2 - q}C^{\prime\; 2}\mspace{14mu}\text{=:}\mspace{14mu} D^{2}}}} & (10) \end{matrix}$ with a positive constant D, i.e. the objects f* come from a ball of radius D√{square root over (v)}. In order to be useful, it is required that α>0, such that 0<q<2. However, later on, a stronger requirement actually will be necessary, namely 0<q<1, which means that the objects must be reasonably strongly compressible. 3.2 Oracle Inequality

Although the risk R(f) is not directly applicable, it is very useful since it allows us to derive an “oracle inequality” which states that the average empirical risk E{circumflex over (R)}(f) of a reconstruction (obtained in a way to be described below) taken from a candidate set is, roughly speaking, within a constant factor of the ideal risk R(f_(min)) of the best approximation f_(min) in the candidate set. This means that even if complete knowledge of f* would be available and thus the optimal approximation in the candidate set could be found, this optimal approximation would be only marginally better than what is found without this prior knowledge.

Following Jarvis Haupt et al. very closely, it will be shown that for

$\begin{matrix} {{{\hat{\underset{\_}{f}}}_{\min} = {\arg\;{\min\limits_{\underset{\_}{f}}\left( {{\hat{R}\left( \underset{\_}{f} \right)} + \frac{{c\left( \underset{\_}{f} \right)}\log\; 2}{k\; ɛ}} \right)}}},} & (11) \end{matrix}$ where c(f) is a penalty term to be specified later, the risk is bounded by

$\begin{matrix} {{{Er}\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {C_{1}\left( {{r\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)} + \frac{{{c\left( {\underset{\_}{f}}_{\min} \right)}\log\; 2} + 4}{k\; ɛ}} \right)}} & (12) \end{matrix}$ with a constant C₁ of order 1 and ε a constant to be specified later. As will be seen below, the oracle inequality can only be proved for compressible objects, unlike in Jarvis Haupt et al. where a similar inequality holds for all objects with bounded norm. However, this restriction does not matter in the end as there is only interest in compressible objects anyway. 3.2.1. Proof of the Oracle Inequality

Consider

$\begin{matrix} {{\hat{r}\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)} = {\frac{1}{k}{\sum\limits_{i = 1}^{k}\left\lbrack {\underset{\underset{= {:\xi_{i}}}{︸}}{\mu_{i} - {y_{i}\log\left( \mu_{i} \right)}} - \left( \underset{\underset{= {:\xi_{i}^{*}}}{︸}}{\mu_{i}^{*} - {y_{i}{\log\left( \mu_{i}^{*} \right)}}} \right)} \right\rbrack}}} & (13) \\ {\text{=:} - {\frac{1}{k}{\sum\limits_{i = 1}^{k}u_{i}}}} & (14) \end{matrix}$ with u_(i)=ξ_(l)*−ξ_(l). The u_(i) are independent, identically distributed random variables. Furthermore,

$\begin{matrix} {{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)} = {\frac{1}{k}{\sum\limits_{i = 1}^{k}\left\lbrack {\underset{\underset{= {E\;\xi_{i}}}{︸}}{\frac{1}{n}{\sum\limits_{j = 1}^{n}\left( {{\overset{\_}{\mu}}_{j} - {{\overset{\_}{\mu}}_{j}^{*}{\log\left( {\overset{\_}{\mu}}_{j} \right)}}} \right)}} - \left( \underset{\underset{= {E\;\xi_{i}^{*}}}{︸}}{\frac{1}{n}{\sum\limits_{j = 1}^{n}\left( {{\overset{\_}{\mu}}_{j}^{*} - {{\overset{\_}{\mu}}_{j}^{*}{\log\left( {\overset{\_}{\mu}}_{j}^{*} \right)}}} \right)}} \right)} \right\rbrack}}} & (15) \\ {\mspace{79mu}{{= {{- \frac{1}{k}}{\sum\limits_{i = 1}^{k}{Eu}_{i}}}},{{{{so}\mspace{14mu}{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}} - {\hat{r}\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}} = {\frac{1}{k}{\sum\limits_{j = 1}^{k}{\left( {u_{j} - {Eu}_{j}} \right).}}}}}} & (16) \end{matrix}$ Then the Craig-Bernstein inequality can be applied which states that the probability of

$\begin{matrix} {{\frac{1}{k}{\sum\limits_{j = 1}^{k}\left( {u_{j} - {Eu}_{j}} \right)}} \geq {\frac{t}{k\; ɛ} + {k\; ɛ\frac{{Var}\left( {\frac{1}{k}{\sum\limits_{j = 1}^{k}u_{j}}} \right)}{2\left( {1 - \zeta} \right)}}}} & (17) \end{matrix}$ is less than or equal to e^(−t) for 0<εh≦ζ≦1 and t>0, provided the moment condition

$\begin{matrix} {{E{{u_{j} - {Eu}_{j}}}^{l}} \leq \frac{{l!}{{Var}\left( u_{j} \right)}h^{l - 2}}{2}} & (18) \end{matrix}$ holds for all l≧2 and some fixed h>0. It will be shown below that a certain h can be found such that the moment condition holds for u_(j). It will also be shown that

${{Var}\left( {\frac{1}{k}{\sum\limits_{j = 1}^{k}u_{j}}} \right)} = {{\frac{1}{k^{2}}{\sum\limits_{j = 1}^{k}{{Var}\left( u_{j} \right)}}} \leq {\frac{C}{k}{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}}}$ with a constant C. Armed with these two facts, it is concluded that appropriate ε and ζ can be found such that the probability of

$\begin{matrix} {{{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)} - {\hat{r}\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}} \geq {\frac{t}{k\; ɛ} + {ɛ\frac{C}{2\left( {1 - \zeta} \right)}{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}}}} & (19) \end{matrix}$ is less than e^(−t). Now, a finite candidate set F is introduced from which it is intended to find a good approximation to f*. A penalty c(f) is assigned to each f which obeys Σ_(fεF)2^(−c(f))≦1. At this stage the candidate set and the penalty are completely arbitrary, as long as this inequality holds.

Setting δ:=e^(−t) and inserting δ(f):=2^(−c(f))δ in place of e^(−t) in Ineq. (19), the probability that at least one fεF violates Ineq. (19) is less than Σ_(fεF)δ(f) (Boole's inequality). With probability 1−δ therefore, the inequality

$\begin{matrix} {{{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)} - {\hat{r}\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}} \leq {\frac{{{c\left( \underset{\_}{f} \right)}\log\; 2} - {\log\;\delta}}{k\; ɛ} + {ɛ\frac{C}{2\left( {1 - \zeta} \right)}{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}}}} & (20) \end{matrix}$ holds for all fεF.

Let ζ=εh and

$a:={\frac{ɛ\; C}{2\left( {1 - \zeta} \right)}.}$ Then choosing some

$0 < ɛ < \frac{2}{C + {2h}}$ guarantees that 0<a<1 and ζ<1. Therefore

$\begin{matrix} {{\left( {1 - a} \right){r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}} \leq {{\hat{r}\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)} + \frac{{{c\left( \underset{\_}{f} \right)}\log\; 2} - {\log\;\delta}}{k\; ɛ}}} & (21) \end{matrix}$ with probability at least 1−δ for all fεF and all 0<δ≦1.

The bound on the risk is minimal for that f which minimizes the penalized empirical risk:

$\begin{matrix} {{\underset{\_}{\hat{f}}}_{\min} = {{\arg\;{\min\limits_{\underset{\_}{f} \in F}\left( {{\hat{r}\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)} + \frac{{c\left( \underset{\_}{f} \right)}\log\; 2}{k\; ɛ}} \right)}} = {\arg\;{\min\limits_{\underset{\_}{f} \in F}{\left( {{\hat{R}\left( \underset{\_}{f} \right)} + \frac{{c\left( \underset{\_}{f} \right)}\log\; 2}{k\; ɛ}} \right).}}}}} & (22) \end{matrix}$

Let f_(mm) be the element of F which minimizes the penalized (true) risk, i.e.

$\begin{matrix} {{f_{\min} = {\arg\;{\min\limits_{\underset{\_}{f} \in F}\;\left( {{R\left( \underset{\_}{f} \right)} + \frac{{c\left( \underset{\_}{f} \right)}\log\; 2}{k\; ɛ}} \right)}}},{then}} & (23) \\ {{\left( {1 - a} \right){r\left( {{\underset{\_}{\hat{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)}} \leq {{\hat{r}\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)} + \frac{{{c\left( {\underset{\_}{f}}_{\min} \right)}\log\; 2} - {\log\;\delta}}{k\; ɛ}}} & (24) \end{matrix}$ (with probability at least 1−δ) since {circumflex over (f)}_(min) minimizes the penalized empirical risk, and replacing it by f_(min) on the right hand side can only make the bound bigger.

Repeating the application of the Craig-Bernstein inequality for {circumflex over (r)}(f_(min),f*)−r(f_(min),f*) (note that the sign is reversed as compared to the above discussion, but the Craig-Bernstein inequality can be employed either way) yields

$\begin{matrix} {{{\hat{r}\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)} - {r\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)}} \leq {{{ar}\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)} - \frac{\log\;\delta}{k\; ɛ}}} & (25) \end{matrix}$ with probability at least 1−δ. Using Boole's inequality again to estimate the probability that Ineqs. (24) and (25) are simultaneously satisfied yields

$\begin{matrix} {{r\left( {{\underset{\_}{\hat{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {{\frac{1 + a}{1 - a}{r\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)}} + \frac{{{c\left( {\underset{\_}{f}}_{\min} \right)}\log\; 2} - {2\;\log\;\delta}}{k\;{ɛ\left( {1 - a} \right)}}}} & (26) \end{matrix}$ with probability at least 1−2δ.

Since for any random variable X, EX≦∫₀ ^(∞)dt Prob(X≧t),

$X = {{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} - {\frac{1 + a}{1 - a}{r\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)}} - \frac{{c\left( {\underset{\_}{f}}_{\min} \right)}\log\; 2}{k\;{ɛ\left( {1 - a} \right)}}}$ and δ=e^(−kεt(1−a)/2) is chosen and Ineq. (26) is integrated over t, which finally gives a bound for Er({circumflex over (f)} _(min),f*):

$\begin{matrix} {{{Er}\left( {{\underset{\_}{\hat{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {{\frac{1 + a}{1 - a}{r\left( {{\underset{\_}{f}}_{\min},\underset{\_}{f}} \right)}^{*}} + \frac{{{c\left( {\underset{\_}{f}}_{\min} \right)}\log\; 2} + 4}{k\;{ɛ\left( {1 - a} \right)}}}} & (27) \\ {\leq {\frac{1 + a}{1 - a}{\left( {{r\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)} + \frac{{{c\left( {\underset{\_}{f}}_{\min} \right)}\log\; 2} + 4}{k\; ɛ}} \right).}}} & (28) \end{matrix}$

This is the inequality announced above with

$C_{1} = {\frac{1 + a}{1 - a}.}$ 3.2.2. Proof of the Moment Condition

The proof of the moment conditions illustrates the main difference between the present invention and the concept proposed by Jarvis Haupt et al. (cited above). Two difficulties have to be considered: first, the random variables are not simple independent Gaussians but Poissonians dependent on the values μ_(l) which are themselves random variables, and second, Rademacher chaos cannot be used. Rademacher chaos, by its randomization of signs, can deal with sparsity in any basis (the measurement basis is with high probability incoherent with any other basis). Here, it will be shown that the sparsity basis T must be incoherent with the system matrix A. This is in line with the results from J. Candès et al. (cited above).

It must be shown that the moment condition (18) holds for some h>0 and all l≧2. According to Jarvis Haupt et al. (cited above) it is sufficient to find a suitable constant h′ for all even l as this implies that the moment condition holds for all l with h=2h′ (Lemma 1 of Jarvis Haupt et al.). The random variable u_(j)−Eu_(j) can be split into two parts, u_(j)−Eu_(j)=X₁+X₂, with X ₁:=−(μ_(j) −Eu _(j))+μ_(j)*log(μ_(j))−Eμ _(j)*log(μ_(j))+μ_(j) *−Eμ _(j)*−(μ_(j)*log(μ_(j)*)−Eμ _(j)*log(μ_(j)*))  (29) X ₂:=(y _(j)−μ_(j)*)log(μ_(j))−(y _(j)−μ_(j)*)log(μ_(j)*)  (30) each of which is a random variable with zero mean. Furthermore, EX₁X₂=0. Therefore, Lemma 2 of Jarvis Haupt et al. can be applied, and it is concluded that X₁+X₂ satisfies the moment condition (18) for all even l≧4 with constant h′=−√{square root over (2)}(h₁+h₂) if X₁ and X₂ satisfy them separately with constants h₁ and h₂.

A bounded random variable X with zero mean and |X|≦B satisfies the moment condition trivially with constant h_(x)=B. If it is observed that

$\begin{matrix} {{\overset{\_}{\mu}}_{i}^{*} = {{{\sum\limits_{j}\;{A_{ij}f_{j}}} + r_{i}} = {{{\sum\limits_{jk}\;{A_{ij}T_{jk}\theta_{k}^{*}}} + r_{i}} \leq {{\sum\limits_{k}\;{{{\sum\limits_{j}\;{A_{ij}T_{jk}}}}{\theta_{k}^{*}}}} + r_{i}} \leq {{\max\limits_{ik}{\left( {({AT})_{ik}} \right){\sum\limits_{k = 1}^{v}\;{\theta_{k}^{*}}}}} + r_{i}}}}} & (31) \\ {\mspace{79mu}{{{\leq {{{{const}.} \times \sqrt{v}{\max\limits_{ik}{\left( {({AT})_{ik}} \right){\sum\limits_{k = 1}^{v}\; k^{{- 1}/q}}}}} + {\max\limits_{i^{\prime}}\left( r_{i^{\prime}} \right)}}} = {\text{:}\mspace{11mu} A_{\max}}},}} & (32) \end{matrix}$ then μ _(l) is upper bounded by a constant A_(max). If the object f* is strongly compressible with 0<q<1, then the sum over k can be estimated by a constant, and depending on the value of max_(lk)(|(AT)_(lk)|), the bound A_(max) may depend on v, or not. If, for instance, A_(ij)=δ_(ij) and T_(ij) is the Fourier basis, it is known that

${\max_{ik}\left( {({AT})_{ik}} \right)} = \frac{1}{\sqrt{v}}$ (the measurement basis and the sparsity basis are maximally incoherent), so A_(max) does not depend on v. This is the optimal situation. In general, however, it is expected that A_(max)=O(v^(n)) with an exponent 0≦η≦½. In any case, it can be assumed without loss of generality that A_(max)>1.

Since μ_(j)* is also bounded from below by r_(j), it may be written (increasing A_(max) if necessary)

$\begin{matrix} {\mu_{j}^{*} \geq {\frac{1}{A_{\max}}.}} & (33) \end{matrix}$

It is reasonable to demand the same bounds of the candidate projections μ_(i). It then follows that |X₁|≦const.×A_(max) log(A_(max)), and thus the moment condition holds.

It remains to show that the moment condition also holds for X₂. Consider

$\begin{matrix} {{EX}_{2}^{2m} = {\frac{1}{n}{\sum\limits_{i = 1}^{n}\;{{M_{2m}\left( {\overset{\_}{\mu}}_{i}^{*} \right)}{\log^{2m}\left( \frac{{\overset{\_}{\mu}}_{i}}{{\overset{\_}{\mu}}_{i}^{*}} \right)}}}}} & (34) \\ {= {\frac{1}{n}{\sum\limits_{i = 1}^{n}\;{{M_{2}\left( {\overset{\_}{\mu}}_{i}^{*} \right)}{\log^{2}\left( \frac{{\overset{\_}{\mu}}_{i}}{{\overset{\_}{\mu}}_{i}^{*}} \right)}\frac{M_{2m}\left( {\overset{\_}{\mu}}_{i}^{*} \right)}{M_{2}\left( {\overset{\_}{\mu}}_{i}^{*} \right)}{{\log^{{2m} - 2}\left( \frac{{\overset{\_}{\mu}}_{i}}{{\overset{\_}{\mu}}_{i}^{*}} \right)}.}}}}} & (35) \end{matrix}$

Here M_(2m)(μ) is the 2m-th central moment of a Poisson variable with parameter μ. The second logarithm on the right hand side can be estimated by

$\begin{matrix} {{\log^{{2m} - 2}\left( \frac{{\overset{\_}{\mu}}_{i}}{{\overset{\_}{\mu}}_{i}^{*}} \right)} \leq {{\log^{{2m} - 2}\left( A_{\max}^{2} \right)}.}} & (36) \end{matrix}$

It can be shown (see 3.5 below) that the central moments obey M_(2m)(μ)≦(2m)!(max(1,μ))^(m), such that

$\begin{matrix} {\frac{M_{2m}\left( {\overset{\_}{\mu}}_{i}^{*} \right)}{M_{2}\left( {\overset{\_}{\mu}}_{i}^{*} \right)} \leq {{\left( {2m} \right)!}\frac{\left( {\max\left( {1,{\overset{\_}{\mu}}_{i}^{*}} \right)} \right)^{m}}{{\overset{\_}{\mu}}_{i}^{*}}} \leq {{\left( {2m} \right)!}A_{\max}^{\frac{{2m} - 2}{2}}\frac{\max\left( {1,{\overset{\_}{\mu}}_{i}^{*}} \right)}{{\overset{\_}{\mu}}_{i}^{*}}}} & (37) \\ {\leq {{\left( {2m} \right)!}A_{\max}^{m}} \leq {\frac{\left( {2m} \right)!}{2}{\left( {\sqrt{2}A_{\max}} \right)^{{2m} - 2}.}}} & (38) \end{matrix}$

The last step is valid for all m≧2. Together the bound is obtained

$\begin{matrix} {{EX}_{2}^{2\; m} \leq {\frac{\left( {2\; m} \right)!}{2}\frac{1}{n}{\sum\limits_{i = 1}^{n}{{M_{2}\left( {\overset{\_}{\mu}}_{i}^{*} \right)}{\log^{2}\left( \frac{{\overset{\_}{\mu}}_{i}}{{\overset{\_}{\mu}}_{i}^{*}} \right)}\left( {2\sqrt{2}A_{\max}{\log\left( A_{\max} \right)}} \right)^{{2\; m} - 2}}}}} & (39) \\ {\mspace{79mu}{{= {\frac{\left( {2\; m} \right)!}{2}{{Var}\left( X_{2} \right)}\left( {2\sqrt{2}A_{\max}{\log\left( A_{\max} \right)}} \right)^{{2\; m} - 2}}},}} & (40) \end{matrix}$ which is the moment condition for X₂.

Taken together, it is established that X₁+X₂ obey the moment condition with a parameter h with h=const.×A _(max) log(A _(max)),  (41) i.e. h grows proportionally to A_(max) log A_(max). This is not a problem if A_(max) is of order 1, but as argued above, this is not always guaranteed. The consequences of this will be shown below.

The last task is to find an upper bound for Var(u_(j)) where u_(j)=ξ_(j)*−ξ_(j) and ξ_(j)*=μ_(j)*−y_(j) log(μ_(j)*), ξ_(j)=μ_(j)−y_(j) log(μ_(j)). It is easy to show that the average values Eu_(j) and Eu_(j) ² are given by

$\begin{matrix} {{Eu}_{j} = {{- \frac{1}{n}}{\sum\limits_{l = 1}^{n}\left( {{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \right)}}} & (42) \\ {{Eu}_{j}^{2} = {\frac{1}{n}{\sum\limits_{l = 1}^{n}{\left\lbrack {\left( {{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \right)^{2} + {{\overset{\_}{\mu}}_{l}^{*}\left( {{\log\left( {\overset{\_}{\mu}}_{l} \right)} - {\log\left( {\overset{\_}{\mu}}_{l}^{*} \right)}} \right)}^{2}} \right\rbrack.}}}} & (43) \end{matrix}$

For the definition of R_(i)(f) see 3.1 above. The variance is then

$\begin{matrix} {{{Var}\left( u_{j} \right)} = {{\frac{1}{n^{2}}{\sum\limits_{l,{l^{\prime} = 1}}^{n}{\left( {{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \right)\left( {{R_{l^{\prime}}\left( \underset{\_}{f} \right)} - {R_{l^{\prime}}\left( {\underset{\_}{f}}^{*} \right)}} \right)\left( {{n\;\delta_{{ll}^{\prime}}} - 1} \right)}}} + {\frac{1}{n}{\sum\limits_{l = 1}^{n}{{\overset{\_}{\mu}}_{l}^{*}\left( {{\log\left( {\overset{\_}{\mu}}_{l} \right)} - {\log\left( {\overset{\_}{\mu}}_{l}^{*} \right)}} \right)}^{2}}}}} & (44) \\ {\mspace{79mu}{\leq {{\frac{n - 1}{n^{2}}{\sum\limits_{l = 1}^{n}\left( {{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \right)^{2}}} + {\frac{1}{n}{\sum\limits_{l = 1}^{n}{{{\overset{\_}{\mu}}_{l}^{*}\left( {{\log\left( {\overset{\_}{\mu}}_{l} \right)} - {\log\left( {\overset{\_}{\mu}}_{l}^{*} \right)}} \right)}^{2}.}}}}}} & (45) \end{matrix}$

The inequality follows because each term R_(l′)(f)−R_(l′)(f) is nonnegative and one may thus omit some of the terms with a negative sign in the first sum by replacing nδ_(ll′)−1 by nδ_(ll′)−δ_(ll′).

Since

${\frac{1}{A_{\max}} \leq {\overset{\_}{\mu}}_{l}},{{\overset{\_}{\mu}}_{l}^{*} \leq A_{\max}},$ it follows that

$\begin{matrix} {{{{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \leq {A_{\max} - \frac{1}{A_{\max}} + {2\; A_{\max}{\log\left( A_{\max} \right)}}}},} & (46) \end{matrix}$ such that

$\begin{matrix} {{\frac{n - 1}{n^{2}}{\sum\limits_{l = 1}^{n}\left( {{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \right)^{2}}} \leq {\left( {A_{\max} - \frac{1}{A_{\max}} + {2\; A_{\max}{\log\left( A_{\max} \right)}}} \right)\frac{1}{n}{\sum\limits_{l = 1}^{n}\left( {{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \right)}}} & (47) \\ {\mspace{79mu}{= {\left( {A_{\max} - \frac{1}{A_{\max}} + {2\; A_{\max}{\log\left( A_{\max} \right)}}} \right){{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}.}}}} & (48) \end{matrix}$

It remains to bound the term

$\frac{1}{n}{\sum\limits_{l = 1}^{n}{{{\overset{\_}{\mu}}_{l}^{*}\left( {{\log\left( {\overset{\_}{\mu}}_{l} \right)} - {\log\left( {\overset{\_}{\mu}}_{l}^{*} \right)}} \right)}^{2}.}}$ In order to do so, the functions h_(y)(x)=y(log x−log y)² and g_(y)(x)=x−y log x−(y−y log y) are examined. They both attain their global minimum 0 at x=y and have zero derivative there. Their second derivatives are

${{h_{y}^{''}(x)} = {{\frac{2\; y}{x^{2}}\left( {1 + {\log\; y} - {\log\; x}} \right)\mspace{14mu}{and}\mspace{14mu}{g_{y}^{''}(x)}} = \frac{y}{x^{2}}}},$ which implies h″_(y)(x)≦2(1+|log y−log x|)g″_(y)(x)≦2(1+2 log(A_(max)))g″_(y)(x) for 1/A_(max)≦x,y≦A_(max).

Therefore h_(y)(x)≦2(1+2 log(A_(max)))g_(y)(x). Consequently,

$\begin{matrix} {{\frac{1}{n}{\sum\limits_{l = 1}^{n}{{\overset{\_}{\mu}}_{l}^{*}\left( {{\log\left( {\overset{\_}{\mu}}_{l} \right)} - {\log\left( {\overset{\_}{\mu}}_{l}^{*} \right)}} \right)}^{2}}} \leq {2\left( {1 + {2\;{\log\left( A_{\max} \right)}}} \right)\frac{1}{n}{\sum\limits_{l = 1}^{n}\left( {{R_{l}\left( \underset{\_}{f} \right)} - {R_{l}\left( {\underset{\_}{f}}^{*} \right)}} \right)}}} & (49) \\ {\mspace{79mu}{= {2\left( {1 + {2\;{\log\left( A_{\max} \right)}}} \right){{r\left( {\underset{\_}{f},{\underset{\_}{f}}^{*}} \right)}.}}}} & (50) \end{matrix}$

Combined, it is obtained Var(u _(j))≦Cr(f,f*)  (51) with

$\begin{matrix} {C = {{\left( {A_{\max} + 2} \right)\left( {{2\;{\log\left( A_{\max} \right)}} + 1} \right)} - {\frac{1}{A_{\max}}.}}} & (52) \end{matrix}$

Note that C grows as A_(max) log A_(max), just as the constant h.

3.3 Application of the Oracle Inequality to Compressible Objects

A compressible object f* is one which can be represented accurately by a small number of coefficients in some basis. To be precise, if f_(j)*=Σ_(j′)T_(jj′)θ_(j)* where T_(jj′) is an orthogonal matrix and θ_(j′)* are the coefficients, and if f^((m)) is the best m-term approximation to f* in this basis, then the error

$\begin{matrix} {{\frac{1}{n}{{{\underset{\_}{f}}^{(m)} - {\underset{\_}{f}}^{*}}}^{2}} \leq {C_{A}m^{{- 2}\;\alpha}}} & (53) \end{matrix}$ decays at least as fast as m^(−2α) if f* is compressible. As shown above, such compressible objects also lie within a ball of radius D√{square root over (v)} with some constant D>0. From the oracle inequality it is known that

${{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {C_{1}\left( {{r\left( {{\underset{\_}{f}}_{\min},{\underset{\_}{f}}^{*}} \right)} + \frac{{{c\left( {\underset{\_}{f}}_{\min} \right)}{\log(2)}} + 4}{k\; ɛ}} \right)}},$ where f_(min) is that vector from the candidate set F which minimizes the risk. This can be reformulated in terms of the coefficient vectors θ* of f* and θ of f:

$\begin{matrix} {{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {{C_{1}\left( {{r\left( {{T\;{\underset{\_}{\theta}}_{\min}},{T\;{\underset{\_}{\theta}}^{*}}} \right)} + \frac{{{c\left( {\underset{\_}{\theta}}_{\min} \right)}{\log(2)}} + 4}{k\; ɛ}} \right)}.}} & (54) \end{matrix}$

The candidate set F is chosen to consist of all f which satisfy the bounds f_(j)≧0 and |f|≦√{square root over (v)}D, are compressible and which have a representation f=Tθ where the coefficients θ_(i) are uniformly quantized to v^(p) levels. Let T be the set of coefficient vectors θ corresponding to the set F. The penalty is chosen to be c(θ)=(1+p)log(v)νθ∥₀, i.e. equal to the 0-norm (the number of non-zero elements) of θ, up to a factor. This penalty satisfies Σ _(θεT)2^(−c(θ))≦1, which is called Kraft inequality in this context.

Let θ ^((m)) be the coefficient vector corresponding to the best m-term approximation to f*, i.e. f^((m))=Tθ ^((m)), and let θ _(q) ^((m))εT be the closest element to θ ^((m)) in T. θ _(min) can now be replaced in the oracle inequality by θ _(q) ^((m)) since

${{r\left( {{T\;{\underset{\_}{\theta}}_{\min}},{T\;{\underset{\_}{\theta}}^{*}}} \right)} + \frac{{{c\left( {\underset{\_}{\theta}}_{\min} \right)}{\log(2)}} + 4}{k\; ɛ}} \leq {{r\left( {{T\;{\underset{\_}{\theta}}_{q}^{(m)}},{T\;{\underset{\_}{\theta}}^{*}}} \right)} + \frac{{{c\left( {\underset{\_}{\theta}}_{q}^{(m)} \right)}{\log(2)}} + 4}{k\; ɛ}}$ by definition of θ _(min).

Next Taylor's theorem is applied to the term r(Tθ _(q) ^((m)),Tθ*) and one obtains

$\begin{matrix} {{r\left( {{T\;{\underset{\_}{\theta}}_{q}^{(m)}},{T\;{\underset{\_}{\theta}}^{*}}} \right)} = {{r\left( {T\;{\underset{\_}{\theta}}^{*}T\;{\underset{\_}{\theta}}^{*}} \right)} + {\sum\limits_{i}{\left( {T\left( {{\underset{\_}{\theta}}_{q}^{(m)} - {\underset{\_}{\theta}}^{*}} \right)} \right)_{i}\frac{\partial r}{\partial\theta_{i}}\left( {{T\;{\underset{\_}{\theta}}^{*}},{T\;{\underset{\_}{\theta}}^{*}}} \right)}} + {\frac{1}{2}{\sum\limits_{ij}{\left( {T\left( {{\underset{\_}{\theta}}_{q}^{(m)} - {\underset{\_}{\theta}}^{*}} \right)} \right)_{i}\frac{\partial^{2}r}{{{\partial\theta_{i}}{\partial\theta_{j}}}\;}\left( {{T\;{\underset{\_}{\eta}}_{ij}},{T\;{\underset{\_}{\theta}}^{*}}} \right){\left( {T\left( {{\underset{\_}{\theta}}_{q}^{(m)} - {\underset{\_}{\theta}}^{*}} \right)} \right)_{j}.}}}}}} & (55) \end{matrix}$

The derivatives here act on the first argument of r. The first and second terms are 0 since the risk r assumes its minimum of 0 when the two arguments coincide. The last term is the remainder term and the η _(ij) suitable constants which lie on the straight line between θ* and θ _(q) ^((m)). The second derivative which appears in the remainder is

$\begin{matrix} {{\frac{\partial^{2}r}{{\partial\theta_{i}}{\partial\theta_{j}}}\left( {{T\;{\underset{\_}{\eta}}_{ij}},{T\;{\underset{\_}{\theta}}^{*}}} \right)} = {\frac{1}{n}{\sum\limits_{k = 1}^{n}\;{{R_{k}^{\prime\prime}\left( {{\overset{\_}{u}}_{k}\left( {T\;{\underset{\_}{\eta}}_{ij}} \right)} \right)}({AT})_{ki}{({AT})_{kj}.}}}}} & (56) \end{matrix}$

The remainder term can be estimated by bounding

${{R_{k}^{\prime\prime}\left( {\overset{\_}{u}}_{k} \right)} = {\frac{{\overset{\_}{\mu}}_{k}^{*}}{{\overset{\_}{\mu}}_{k}^{2}} \leq A_{\max}^{3}}},$ which is valid for all allowed μ _(k). This bound may be too conservative: if it is assumed that f^((m)), as the best m-term approximation, is close to f*, then it may be more appropriate to assume that μ _(k) is within a factor of, say, 2 of μ _(k)*. In that case the bound is const.×A_(max). It will be therefore written R″_(k)( μ _(k))≦cA_(max) ^(β) with a constant c>0 and an exponent 1≦β≦3.

Then for a vector x one obtains:

$\begin{matrix} {{{\frac{1}{2}{\sum\limits_{ij}{x_{i}\frac{\partial^{2}r}{{\partial\theta_{i}}{\partial\theta_{j}}}\left( {{T\;{\underset{\_}{\eta}}_{ij}},{T\;{\underset{\_}{\theta}}^{*}}} \right)x_{j}}}} \leq {\frac{{cA}_{\max}^{\beta}}{2n}{{{AT}\underset{\_}{x}}}^{2}} \leq {\frac{{cA}_{\max}^{\beta}}{2n}{{AT}}^{2}{\underset{\_}{x}}^{2}}},} & (57) \end{matrix}$ where ∥•∥ is the standard l₂ matrix norm. ∥AT∥=∥A∥ since T is merely a change of basis. The matrix A is a n×v matrix. From matrix algebra it is known that ∥AT∥≦√{square root over (nv)}∥A∥_(max), where the maximum norm ∥•∥_(max) denotes the maximum absolute value of the entries. It is denoted

$\begin{matrix} {\Lambda:=\left\{ \begin{matrix} {A} \\ {{\sqrt{nv}{A}_{\max}},} \end{matrix} \right.} & (58) \end{matrix}$ depending on whether A is such that a statement can be made about ∥A∥, which might be difficult in general, or not, in which case ∥A∥_(max) is much easier to handle but could give a worse error bound in the end. Therefore

$\begin{matrix} {{r\left( {{T\;{\underset{\_}{\theta}}_{q}^{(m)}},{T\;{\underset{\_}{\theta}}^{*}}} \right)} \leq {\frac{c}{2n}A_{\max}^{\beta}\Lambda^{2}{{{T\left( \;{{\underset{\_}{\theta}}_{q}^{(m)} - \;{\underset{\_}{\theta}}^{*}} \right)}}^{2}.}}} & (59) \end{matrix}$

In order to estimate the risk r(Tθ _(q) ^((m)),Tθ*) it remains to bound |T(θ _(q) ^((m))−θ*)|² which can be done in the following way:

$\begin{matrix} {{{T\left( \;{{\underset{\_}{\theta}}_{q}^{(m)} - \;{\underset{\_}{\theta}}^{*}} \right)}}^{2} = {{\left( \;{{\underset{\_}{\theta}}_{q}^{(m)} - \;{\underset{\_}{\theta}}^{*}} \right)}^{2} \leq {{\;{{\underset{\_}{\theta}}_{q}^{(m)} - \;{\underset{\_}{\theta}}^{(m)}}}^{2} + {2{{\;{{\underset{\_}{\theta}}_{q}^{(m)} - \;{\underset{\_}{\theta}}^{(m)}}} \cdot {\;{{\underset{\_}{\theta}}^{(m)} - \;{\underset{\_}{\theta}}^{*}}}}} + {\;{{\underset{\_}{\theta}}^{(m)} - \;{\underset{\_}{\theta}}^{*}}}^{2}}}} & (60) \\ {\mspace{70mu}{\leq {\frac{v^{2}D^{2}}{v^{2p}} + {2\sqrt{\frac{v^{3}D^{2}C_{A}}{v^{2p}}}m^{- \alpha}} + {C_{A}{{vm}^{{- 2}\alpha}.}}}}} & (61) \end{matrix}$

Combined, it is obtained

$\begin{matrix} {{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {{C_{1}\left( {{\frac{c}{2n}A_{\max}^{\beta}{\Lambda^{2}\left( {\frac{v^{2}D^{2}}{v^{2p}} + {2\sqrt{\frac{v^{3}D^{2}C_{A}}{v^{2p}}}m^{- \alpha}} + {C_{A}v\; m^{{- 2}\alpha}}} \right)}} + \frac{{c\left( {\underset{\_}{\theta}}_{\min} \right)\log\; 2} + 4}{k\; ɛ}} \right)}.}} & (62) \end{matrix}$

The two terms involving v^(−p) are exponentially small in p and may be ignored. The remaining terms are minimal when

$\begin{matrix} {m = {\left( \frac{\left( {1 + p} \right)\log\; v\;\log\; 2}{\alpha\; k\; ɛ\; c\; A_{\max}^{\beta}\Lambda^{2}C_{A}\frac{v}{n}} \right)^{\frac{1}{{2\;\alpha} + 1}}.}} & (63) \end{matrix}$

Inserting this in Eq. (62) it is obtained

$\begin{matrix} {{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {C_{1}\left\lbrack {{\left( {\frac{1}{2\alpha} + 1} \right)\left( {\alpha\; c\; A_{\max}^{\beta}\Lambda^{2}C_{A}\frac{v}{n}} \right)^{\frac{1}{{2\alpha} + 1}}\left( {\left( {1 + p} \right)\log\; 2} \right)^{\frac{2\alpha}{{2\alpha} + 1}}\left( \frac{\log\; v}{k\; ɛ} \right)^{\frac{2\alpha}{{2\alpha} + 1}}} + \frac{4}{k\; ɛ}} \right\rbrack}} & (64) \\ {\leq {{C_{1}\left\lbrack {{\left( {\frac{1}{2\alpha} + 1} \right)\left( {\alpha\;{cC}_{A}\frac{v}{n}} \right)^{\frac{1}{{2\alpha} + 1}}\left( {\left( {1 + p} \right)\log\; 2} \right)^{\frac{2\alpha}{{2\alpha} + 1}}} + 4} \right\rbrack}\left( \frac{\left( {A_{\max}^{\beta}\Lambda^{2}} \right)^{\frac{1}{2\alpha}}ɛ^{- \frac{{2\alpha} + 1}{2\alpha}}\log\; v}{k} \right)^{\frac{2\alpha}{{2\alpha} + 1}}}} & (65) \end{matrix}$

The last inequality follows if it is assumed that A_(max) ^(β)Λ²≧1 and ε≦1, both of which is possible without loss of generality since A_(max) may be increased until they are both satisfied. Recall that one may choose any

${0 < ɛ < \frac{2}{C + {2h}}} = {{O\left( \frac{1}{A_{\max}\log\; A_{\max}} \right)}.}$ In order to keep the constant C₁ close to 1, ε should be chosen not too close to the upper bound. For instance, the choice

$\begin{matrix} {ɛ = {\frac{1}{4}\frac{2}{C + {2h}}}} & (66) \end{matrix}$ is sensible since it implies 1<C₁< 5/3. Since both C and h increase with A_(max), ε<1 can be achieved by increasing A_(max) if necessary.

Eq. (65) is the final error bound. Unlike similar bounds as, e.g. in Jarvis Haupt et al. (cited above), the important last term here contains the additional factor

$A_{\max}^{\frac{\beta}{2\;\alpha}}\Lambda^{\frac{1}{\alpha}}ɛ^{- \frac{{2\alpha} + 1}{2\;\alpha}}$ which depends on v if A_(max) or Λ do.

When the object f* is truly sparse, i.e. only m coefficients θ _(l)* are nonzero, the term |θ ^((m))−θ*|=0, so the only relevant term is the penalty term. Then the result is obtained

$\begin{matrix} {{r\left( {{\underset{\_}{\hat{f}}}_{\min},\underset{\_}{f^{*}}} \right)} \leq {{C_{1}\left( {{\left( {1 + p} \right)\log\;(2)} + 4} \right)}{\frac{m\;\log\; v}{ɛ\; k}.}}} & (67) \end{matrix}$ 3.4. Applicability of the Compressed Sensing Strategy

Whether the error bound derived above is useful or not depends on the constants A_(max) and Λ. If A_(max) and Λ do not depend on v, the same type of error bound as in Jarvis Haupt et al. (cited above) is obtained. A situation where this happens is for instance the case A_(ij)=δ_(ij) and T the Fourier basis.

But even if they do depend on v, the compressive sensing strategy may still be useful if the additional factor

$A_{\max}^{\frac{\beta}{2\;\alpha}}\Lambda^{\frac{1}{\alpha}}ɛ^{- \frac{{2\alpha} + 1}{2\;\alpha}}$ grows with a power of v less than 1. Imagine, for example, that A_(max)=O(v^(1/6)). This would be the case when A is a typical system matrix of a tomographic setup, which has of order v^(1/3) nonzero entries in each row, and T is a random orthogonal matrix, such that Σ_(j)A_(ij)T_(jk) is a sum of O(v^(1/3)) terms, each of order O(v^(−1/2)) and with random sign, resulting in a number O(v^(−1/3)). Hence A_(max)=O(v^(1/6)). For such a system matrix, ∥A∥=Λ=O(v^(1/3)) is expected. The important term becomes

$\begin{matrix} {\frac{v^{\frac{{2\;\alpha} + \beta + 5}{12\;\alpha}}\log^{\frac{{2\alpha} + 1}{2\;\alpha} + 1}v}{k}.} & (68) \end{matrix}$

The exponent

$\frac{{2\;\alpha} + \beta + 5}{12\;\alpha}$ is less than 1 for all

${\alpha > \frac{\beta + 5}{10}} = \frac{3}{5}$ (if β=1 is taken). Thus if the object is reasonably compressible, compressive sensing works because this quotient may be small even if k<<v.

For truly sparse objects, a similar discussion as above applies to the v-dependence of ε⁻¹. But since it has been argued that A_(max) can be at most of order O(v^(1/2)), compressive sensing works in any case if mv^(1/2)=o(v). Note that m may depend on v, so this is not always true.

3.5. Central Moments of the Poisson Distribution

According to J. M. Noras (“Some formulas for moments of the Poisson distribution” in “Phys. Rev. B” vol. 22 (12), 1980, p. 6474-6475) and references therein, the central moments of the Poisson distribution M_(n)(μ) obey the following recursion relation:

$\begin{matrix} {{M_{n}(\mu)} = {{{\mu\left( {n - 1} \right)}!}{\sum\limits_{i = 0}^{n - 2}{\frac{M_{i}(\mu)}{{i!}{\left( {n - 1 - i} \right)!}}.}}}} & (69) \end{matrix}$

It is shown that for all n and μ≧0, M_(n)(μ)≦n!(max(1,μ))^(n/2). First, it is shown that this is the case for n=0, 1, 2: M ₀(μ)=1≦(max(1,μ))⁰=1  (70) M ₁(μ)=0≦(max(1,μ))^(1/2)  (71) M ₂(μ)=μ≦2(max(1,μ))¹.  (72)

It is now proceed by induction and assumed that M_(i)(μ)≦i!(max(1,μ))^(1/2) holds for all 0≦i<n. Then

$\begin{matrix} {{M_{n}(\mu)} = {{{\mu\left( {n - 1} \right)}!}{\sum\limits_{i = 0}^{n - 2}\frac{M_{i}(\mu)}{{i!}{\left( {n - 1 - i} \right)!}}}}} & (73) \\ {\leq {{\mu\left( {n - 1} \right)}{\sum\limits_{i = 0}^{n - 2}{\frac{\left( {n - 2} \right)!}{{i!}{\left( {n - 1 - i} \right)!}}{i!}\left( {\max\left( {1,\mu} \right)} \right)^{i/2}}}}} & (74) \\ {\leq {{\mu\left( {n - 1} \right)}{\sum\limits_{i = 0}^{n - 2}{\frac{\left( {n - 2} \right)!}{{i!}{\left( {n - 2 - i} \right)!}}{\left( {n - 2} \right)!}\left( {\max\left( {1,\mu} \right)} \right)^{{({n - 2})}/2}}}}} & (75) \\ {= {2\;{{\mu\left( {n - 1} \right)}!}\left( {\max\left( {1,\mu} \right)} \right)^{{({n - 2})}/2}}} & (76) \\ {{\leq {{n!}\left( {\max\left( {1,\mu} \right)} \right)^{n/2}}},} & (77) \end{matrix}$ which concludes the proof. 3.6. The Calibration Factor a

The minimizer of

$\begin{matrix} {{F\left( \underset{\_}{f} \right)} = {{\hat{R}\left( \underset{\_}{f} \right)} + \frac{{C\left( \underset{\_}{f} \right)}\log\; 2}{k\; ɛ}}} & (78) \end{matrix}$ is the sought-for reconstruction. The following table summarizes the results of the above description of the mathematical background:

$\begin{matrix} {\mspace{79mu}{\underset{\_}{f} = {T\;\underset{\_}{\theta}}}} & (79) \\ {\mspace{79mu}{T\text{:}\mspace{14mu}{sparsity}\mspace{14mu}{basis}}} & (80) \\ {\mspace{79mu}{{c\left( \underset{\_}{f} \right)} = {\left( {1 + p} \right){\log(v)}{\underset{\_}{\theta}}_{0}}}} & (81) \\ {\mspace{79mu}{v = {{number}\mspace{14mu}{of}\mspace{14mu}{voxels}}}} & (82) \\ {\mspace{79mu}{p\text{:}\mspace{14mu}{coefficients}\mspace{14mu}\theta_{i}\mspace{14mu}{are}\mspace{14mu}{quantized}\mspace{14mu}{to}\mspace{14mu} v^{p}\mspace{14mu}{levels}}} & (83) \\ {\mspace{79mu}{k = {{number}\mspace{14mu}{of}\mspace{14mu}{projections}\mspace{14mu}{measured}}}} & (84) \\ {\mspace{79mu}{ɛ = {\frac{1}{2}\frac{1}{C + {2\; h}}}}} & (85) \\ {C = {{{\left( {A_{\max} + 2} \right)\left( {{2\;{\log\left( A_{\max} \right)}} + 1} \right)} - \frac{1}{A_{\max}}} \leq {8\; A_{\max}\log\; A_{\max}\mspace{14mu}{for}\mspace{14mu} A_{\max}} \geq e}} & (86) \\ {\mspace{79mu}{h = {\left( {{10\sqrt{2}} + 8} \right)A_{\max}\log\; A_{\max}}}} & (87) \\ {\mspace{79mu}{A_{\max} = {\max\left( {e,{\frac{C^{\prime}}{1 - q}I}} \right)}}} & (88) \\ {I = {\sqrt{v}{\max\limits_{ik}{({AT})_{ik}}\left( {{incoherence}\mspace{14mu}{between}\mspace{14mu}{measurement}\mspace{14mu}{matrix}\mspace{14mu} A\mspace{14mu}{and}\mspace{14mu}{sparsity}\mspace{14mu}{basis}\mspace{14mu} T} \right)}}} & (89) \\ {{C^{\prime}\text{:}\mspace{14mu}{prefactor}\mspace{14mu}{of}\mspace{14mu}{compressibility}\mspace{14mu}{condition}\mspace{14mu}{\theta_{k}}} \leq {C^{\prime}\sqrt{v}k^{{- 1}/q}}} & (90) \\ {\mspace{79mu}{q\text{:}\mspace{14mu}{compressibility}\mspace{14mu}{exponent}}} & (91) \end{matrix}$

The calibration factor a, which is implicitly defined by

$\begin{matrix} {{{F\left( \underset{\_}{f} \right)} = {{\hat{R}\left( \underset{\_}{f} \right)} + {\frac{c\left( \underset{\_}{f} \right)}{k\; ɛ}{\log(2)}\mspace{14mu}\text{=:}\mspace{14mu}{\hat{R}\left( \underset{\_}{f} \right)}} + {a{{T^{T}\underset{\_}{f}}}_{0}}}},} & (92) \end{matrix}$ is thus obtained as

$\begin{matrix} {a = {\frac{\left( {1 + p} \right){\log(v)}{\log(2)}}{k\; ɛ} = {\frac{\left( {1 + p} \right){\log(v)}{\log(2)}}{k}2\left( {C + {2\; h}} \right)}}} & (93) \\ {= {2\frac{\log(v)}{k}\left( {1 + p} \right){\log(2)}\left( {{20\sqrt{2}} + 24} \right)A_{\max}\log\; A_{\max}}} & (94) \\ {= {2\frac{\log(v)}{k}\left( {1 + p} \right){\log(2)}\left( {{20\sqrt{2}} + 24} \right)\frac{C^{\prime}}{1 - q}I\;{{\log\left( {\frac{C^{\prime}}{1 - q}I} \right)}.}}} & (95) \end{matrix}$

The parameters appearing in this expression are all known or can be estimated.

-   -   The constant C′ can be estimated by observing that

$\left. {{\underset{\_}{f}} \leq {\sqrt{v}D}}\Rightarrow C^{\prime} \right. = {\sqrt{\frac{2 - q}{2}}{D.}}$

-   -    The maximum length √{square root over (v)}D of the vector f         should be a relatively accessible number.     -   There must be some prior knowledge as to the compressibility of         the objects measured, i.e. the exponent q must be known. This is         necessary anyway since the method works best if q>1.     -   p is the quantization level of the trial vectors θ, i.e. the         values θ_(i), which necessarily lie between −√{square root over         (v)}D and √{square root over (v)}D, are quantized to v^(p)         levels, i.e. the stepsize is of order v^(1/2−p). When v is         reasonably large (>100, say), a value of p≈10 will be more than         adequate. For larger v, even a smaller p will suffice.     -   It is requested that the sparsity orthobasis T be known.     -   The incoherence I can be obtained from the geometry of the setup         (i.e. the system matrix A) and the sparsity basis T.         3.7. The Risk Bound

The risk of the reconstruction is bounded by

$\begin{matrix} {{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} \leq {{C_{1}\left\lbrack {{\left( {\frac{1}{2\;\alpha} + 1} \right)\left( {\alpha\;{cC}_{A}\frac{v}{n}} \right)^{\frac{1}{{2\;\alpha} + 1}}\left( {\left( {1 + p} \right)\log\; 2} \right)^{\frac{2\;\alpha}{{2\;\alpha} + 1}}} + 4} \right\rbrack}{\left( \frac{\left( {A_{\max}^{\beta}\Lambda^{2}} \right)^{\frac{1}{2\alpha}}\log\; v}{k\; ɛ^{\frac{{2\;\alpha} + 1}{2\;\alpha}}} \right)^{\frac{2\;\alpha}{{2\;\alpha} + 1}}.}}} & (96) \end{matrix}$

The constants appearing here are given by

$\begin{matrix} {C_{1} = \frac{5}{3}} & (97) \\ {\alpha = {\frac{1}{q} - \frac{1}{2}}} & (98) \\ {c = 4\mspace{14mu}\left( {{more}\mspace{14mu}{or}\mspace{14mu}{less}\mspace{14mu}{arbitrary}\mspace{14mu}{number}\mspace{14mu}{of}\mspace{14mu}{order}\mspace{14mu} 1} \right)} & (99) \\ {\beta = 1} & (100) \\ {C_{A} = \frac{{qC}^{\prime}}{2 - q}} & (101) \\ {\Lambda = {{A}\mspace{14mu}{matrix}\mspace{14mu}{norm}\mspace{14mu}{of}\mspace{14mu}{the}\mspace{14mu}{measurement}\mspace{14mu}{matrix}}} & (102) \end{matrix}$

Then a setup is imagined where n pixels (the potential measurements) could have been measured, but actually only k of them were measured. The risk is a measure of the absolute error between the ideal (i.e. noise free) projections of f* and {circumflex over (f)}_(min) for all of the potential measurements (not just the measured ones), normalized by n. That means it is the absolute error per potential measurement pixel.

More important than the absolute error, however, is the relative error, which can be defined as

$\begin{matrix} {{\rho\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)} = {\frac{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)}{\frac{1}{n}{\sum_{i}{\overset{\_}{\mu}}_{i}^{*}}} \approx {\frac{r\left( {{\hat{\underset{\_}{f}}}_{\min},{\underset{\_}{f}}^{*}} \right)}{\frac{1}{n}{\sum_{i}{\overset{\_}{\mu}}_{\min,i}}}.}}} & (103) \end{matrix}$

Here μ _(i)* and μ _(min,i) are the ideal noise free projections of f* and {circumflex over (f)}_(min). The error ρ now means a relative error per pixel. This makes the interpretation of ρ very clear: a statement like “the error ρ is smaller than 10%” is perfectly sensible and understandable.

With the error bound as given above (where all constants are known or can be estimated), a bound can thus be obtained retrospectively (i.e., after the reconstruction) for the relative error per pixel and thus gauged whether the reconstruction is good enough for the purpose at hand.

On the other hand, one can estimate i) dose, ii) measurement time, and iii) number of measurements k necessary to obtain a predetermined relative error, e.g. it could be requested ρ≦10%. It is easy to estimate the average value of μ _(i)* from the dose and the measurement time, and increasing the dose by a factor of λ>1 increases the ideal projections μ _(i)* by λ. Increasing the dose has no effect on the error bound (the right hand side of Eq. (96)) such that the maximum relative error of the new minimizer {circumflex over (f)}_(min) is decreased by a factor of 1/λ according to Eq. (103). The same holds for changing the measurement time by λ. In addition, k can be adjusted in order to bring the error bound down.

4. Experimental Results

FIG. 3 shows sectional images of an inventive SPECT reconstruction with image data of a heart (FIG. 3A) and a bone (FIG. 3C) in comparison with conventional penalized likelihood reconstructions (FIGS. 3B, 3D). The comparison shows a greatly enhanced resolution obtained with the inventive technique in both cases. It is emphasized that the quality of the illustrated images is restricted due to the printing technique and as a result of a restricted number of angular positions. In both cases, image data are collected at a relatively small number of angular positions (heart: 10 angles, bone: 32 angles). In conventional reconstruction, the number of angular positions must be larger (e.g. around 100 or more) in order to achieve a resolution similar to FIGS. 3A and 3C.

The features of the invention disclosed in the above description, the drawings and the claims can be of significance both individually as well as in combination for the realization of the invention it its various embodiments. 

What is claimed is:
 1. Image reconstruction method for reconstructing a tomographic image (f_(j)) of a region of investigation within an object, comprising the steps of: providing detector data (y_(i)) comprising Poisson random values measured at an i-th of a plurality of different positions relative to the object, providing a predetermined system matrix A_(ij) assigning a j-th voxel of the object to the i-th detector data (y_(i)), wherein the system matrix A_(ij) defines the detector data (v_(i)) as linear combinations of the original object data and is determined by geometric or physical features of an imaging device used for collecting said detector data (y_(i)) and reconstructing the tomographic image (f_(j)) based on the detector data (y_(i)), said reconstructing step including a procedure of minimizing a functional F(f) depending on the detector data (y_(i)) and the system matrix A_(ij) and additionally including a sparse or compressive representation of the object in an orthobasis T, wherein the tomographic image (f_(j)) represents a global minimum of the functional F(f).
 2. Image reconstruction method according to claim 1, wherein the reconstructing step includes a procedure of minimizing the functional F(f)=L({y _(i) },A f)+a∥T ^(T) f∥ wherein L({y_(i)}, A f) is a maximum-likelihood risk functional for Poisson statistics, ∥T^(T) f∥ is a sparsity enforcing functional including the l_(p) norm of vector T^(T) f with 0≦p<2, and a is a calibration factor.
 3. Image reconstruction method according to claim 1, wherein the functional F(f)additionally includes an additive regularization function R(f)suppressing artifacts: F(f)=L({y _(i) },A f)+a∥T ^(T) f∥+R(f).
 4. Image reconstruction method according to claim 1, wherein the system matrix A_(ij) is adjusted depending on measuring system reference data or acquired using a calibration measurement.
 5. Image reconstruction method according to claim 1, wherein the orthobasis T is a basis of three-dimensional wavelets with compact carrier, or an adapted basis depending on properties of the object to be imaged.
 6. Image reconstruction method according to claim 1, wherein the tomographic image (f_(j)) is a SPECT image, a PET image, CT image or a confocal microscopy image, and/or the detector data (y_(i)) are provided via a data communication channel, from a data storage or directly by the detector device.
 7. Image reconstruction method according to claim 1, comprising at least one of the further steps of storing, recording, displaying and further processing the tomographic image (f_(j)).
 8. Imaging method for creating an image (f_(j)) of a region of investigation within an object, comprising the steps of: collecting detector data (y_(i)) with a detector device of an imaging device, and subjecting the detector data (y_(i)) to the image reconstruction method according to claim
 1. 9. Imaging method according to claim 8, comprising the step of randomized setting of angular positions (α_(l)).
 10. Imaging method according to claim 8, wherein the detector data (y_(i)) are collected while angular positions (α_(l)) are continuously changed.
 11. Imaging method according to claim 8, wherein a number of angular positions (α_(l)) is selected in dependency on a predetermined image quality measure r.
 12. Imaging device for imaging a region of investigation in an object, the imaging device comprising: a detector device for measuring detector data (y_(i)) comprising Poisson random values measured at an l-th angular position (α_(l)) and an l-th radius of rotation (r_(l)) of the detector device relative to the object, and a reconstruction device for reconstructing an image (f_(j)) the object, said reconstruction device being adapted for subjecting the detector data (y_(i)) to an image reconstruction method according to claim
 1. 13. Computer program residing on a non-transitory computer-readable medium, with a program code being executable by a machine to perform an image reconstruction method for reconstructing a tomographic image (f_(j))of a region of investigation within an object, the method comprising: providing detector data (y_(i)) comprising Poisson random values measured at an i-th of a plurality of different positions relative to the object, providing a predetermined system matrix A_(ij) assigning a j-th voxel of the object to the i-th detector data (y_(i)), wherein the system matrix A_(ij) defines the detector data (y_(i)) as linear combinations of the original object data and is determined by geometric or physical features of an imaging device used for collecting said detector data (y_(i)), and reconstructing the tomographic image (f_(j)) based on the detector data (y_(i)), said reconstructing step including a procedure of minimizing a functional F(f) depending on the detector data (y_(i)) and the system matrix A_(ij) and additionally including a sparse or compressive representation of the object in an orthobasis T, wherein the tomographic image (f_(j)) represents a global minimum of the functional F(f).
 14. Apparatus comprising a non-transitory computer-readable storage medium containing program instructions being executable by a machine to perform an image reconstruction method for reconstructing a tomographic image (f_(j))of a region of investigation within an object, the method including: providing detector data (y_(i)) comprising Poisson random values measured at an i-th of a plurality of different positions relative to the object, providing a predetermined system matrix A_(ij) assigning a j-th voxel of the object to the i-th detector data (y_(i)), wherein the system matrix A_(ij) defines the detector data (y_(i)) as linear combinations of the original object data and is determined by geometric or physical features of an imaging device used for collecting said detector data (y_(i)), and reconstructing the tomographic image (f_(j)) based on the detector data (y_(i)), said reconstructing step including a procedure of minimizing a functional F(f) depending on the detector data (y_(i)) and the system matrix A_(ij) and additionally including a sparse or compressive representation of the object in an orthobasis T , wherein the tomographic image (f_(j))represents a global minimum of the functional F(f). 